(±1)-invariant Sequences and Truncated Fibonacci Sequences of the Second Kind
نویسندگان
چکیده
In this paper we present another characterization of (±1)-invariant sequences. We also introduce truncated Fibonacci and Lucas sequences of the second kind and show that a sequence x ∈ R∞ is (−1)-invariant(1-invariant resp.) if and only if D[ 0 x ] is perpendicular to every truncated Fibonacci(truncated Lucas resp.) sequence of the second kind where D = diag((−1), (−1), (−1), . . .).
منابع مشابه
Toeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملA Class of Convergent Series with Golden Ratio Based on Fibonacci Sequence
In this article, a class of convergent series based on Fibonacci sequence is introduced for which there is a golden ratio (i.e. $frac{1+sqrt 5}{2}),$ with respect to convergence analysis. A class of sequences are at first built using two consecutive numbers of Fibonacci sequence and, therefore, new sequences have been used in order to introduce a new class of series. All properties of the se...
متن کاملA New Kind of Fibonacci-Like Sequence of Composite Numbers
An integer sequence (xn)n≥0 is said to be Fibonacci-like if it satisfies the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. We construct a new type of Fibonacci-like sequence of composite numbers. 1 The problem and previous results In this paper we consider Fibonacci-like sequences, that is, sequences (xn) ∞ n=0 satisfying the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. (1)
متن کاملThe Fibonacci Numbers—Exposed
Among numerical sequences, the Fibonacci numbers Fn have achieved a kind of celebrity status. Indeed, Koshy gushingly refers to them as one of the “two shining stars in the vast array of integer sequences” [16, p. xi]. The second of Koshy’s “shining stars” is the Lucas numbers, a close relative of the Fibonacci numbers, about which we will say more below. The Fibonacci numbers are famous for po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005